Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard

نویسندگان

  • Tatsuie Tsukiji
  • Zhi-Zhong Chen
چکیده

The

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Phylogenetic Roots with Bounded Degrees and Errors

Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the similarity data are represented as a graph G = (V,E) where each vertex represents a species and two vertices are adjacent if they repre...

متن کامل

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs

The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V,E) such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e. leaves) of T are exactly the elements of V , and (3) (u, v) ∈ E if and only if the distance between u and v in tree T is at most k, where k is some fixed threshold k. Such a tree T , if exists, is call...

متن کامل

The Effect of Solar Particles in the Choice of Alloy Shielding in a Satellite

The damages and logical failures in dierent parts of a satellite may occur during a solar event, when a bulk of solar energetic particles approaching the Earth. During solar events, these particles may cause extensive damages which are even permanent (hard errors). A way of damage reduction is designing a proper coating as the fuselage. As protons are the major component of solar particles and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004